-
1 underlying graph
Большой англо-русский и русско-английский словарь > underlying graph
-
2 underlying graph
Математика: основной граф -
3 underlying graph
мат. -
4 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
5 основной граф
underlying graph мат.Русско-английский научно-технический словарь Масловского > основной граф
-
6 основной граф
Большой англо-русский и русско-английский словарь > основной граф
-
7 основной граф
Mathematics: underlying graph -
8 language
- absolutely homogeneous language - absolutely inadequate language - absolutely nonhomogeneous language - absolutely nonperfect language - absolutely nonsimple language - absolutely perfect language - absolutely simple language - completely formalized language - completely homogeneous language - left categorial language - locally perfectly adequate language - locally simple language - locally strongly language - locally well adequate language - noncompletely homogeneous language - right categorial language - scattered context languageindistinguishable in the language — лог. неразличимый на языке, эквивалентный
-
9 manifold
1) коллектор; магистраль2) гребёнка4) геом. многообразие5) патрубок6) анат. летошка7) рампа; батарея газовых баллонов8) многократный; многократно9) камера; распределитель10) многообразный; разнообразный; разнородный•manifold with boundary — многообразие с границей, многообразие с краем
- almost homogeneous manifold - almost orientable manifold - almost parallelizable manifold - almost smooth manifold - completely parallelizable manifold - finitely compact manifold - finitely triangulated manifold - globally harmonic manifold - holomorphically convex manifold - locally homogeneous complex manifold - locally plane manifold - locally symmetric manifold - locally trivial manifold - locally unknotted manifold - maximal integral manifold - orbitally asymptotically stable manifold - strongly harmonic manifold - unlimited covering manifold - weighted homogeneous manifoldmanifold without boundaries — многообразие без границ, многообразие с краем
См. также в других словарях:
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Power graph analysis — In computational biology, power graph analysis is a method for the analysis andrepresentation of complex networks. Power graph analysis is the computation, analysis and visual representation of a power graph from a graphs (networks).Power graph… … Wikipedia
Biased graph — In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then so is the third circle of the theta graph. A biased graph is a… … Wikipedia
Conductance (graph) — For other uses, see Conductance. In graph theory the conductance of a graph G=(V,E) measures how well knit the graph is: it controls how fast a random walk on G converges to a uniform distribution. The conductance of a graph is often called the… … Wikipedia
Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… … Wikipedia
Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… … Wikipedia
Periodic graph (crystallography) — For other uses, see Periodic graph. A (large) unit cell of Diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds … Wikipedia
